Rate Monotonic Analysis for Real-Time Systems
نویسندگان
چکیده
The essential goal of the Rate Monotonic Analysis (RMA) for RealTime Systems Project at the Software Engineering Institute is to catalyze improvement in the practice of real-time systems engineering, specifically by increasing the use of rate monotonic analysis and scheduling algorithms. In this report, we review important decisions in the development of RMA. Our experience indicates that technology transition considerations should be embedded in the process of technology development from the start, rather than as an afterthought.
منابع مشابه
Safety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملAllocating and scheduling tasks in multiple fieldbus real-time systems
We consider real-time systems connected via several fieldbuses. Validating such systems consists in prooving that tasks meet their end-to-end deadlines. Tasks are scheduled on processors by fixed-priority schedulers. We propose an automatic method for allocating tasks on processors and assigning priorities to tasks so that every deadline is met. Allocation and scheduling are simultaneously achi...
متن کاملChapter 7 a Systematic Approach to Designing Distributed Real-time Systems 1
Distributed real-time system design raises new theoretical issues and application challenges beyond those in centralized systems. Rate monotonic scheduling (RMS) theory has been applied successfully in the scheduling of centralized systems. RMS and its generalizations have been adopted by national high-technology projects such as the Space Station and has recently been supported by major open s...
متن کاملNon-preemptive real-time scheduling of dataflow systems
Real-time signal processing applications can be described naturally with dataflow graphs. The systems we consider have a mix of real-time and non-real-time processing, where independent dataflow graphs represent tasks and individual dataflow actors are subtasks. Rate-monotonic scheduling is optimal for fixed-priority, preemptive scheduling of periodic tasks. Priority inheritance protocols exten...
متن کاملSchedulability analysis of global Deadline-Monotonic scheduling
The multiprocessor Deadline-Monotonic (DM) scheduling of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, including a resource augmentation bound.
متن کامل